2-distance Coloring of Sparse Graphs
نویسندگان
چکیده
A 2-distance coloring of a graph is a coloring of the vertices such that two vertices at distance at most 2 receive distinct colors. We prove that every graph with maximum degree Δ at least 4 and maximum average degree less that 73 admits a 2-distance (Δ + 1)-coloring. This result is tight. This improves previous known results of Dolama and Sopena.
منابع مشابه
2-distance coloring of not-so-sparse graphs
The square G of a graph G is the graph obtained from G by adding an edge between every pair of vertices having a common neighbor. A proper coloring of G is also called a 2-distance coloring of G. The maximum average degree Mad(G) of a graph G is the maximum among the average degrees of the subgraphs of G, i.e. Mad(G) = max { 2|E(H)| V (H) |H ⊆ G } . Graphs with bounded maximum average degree ar...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملThe t-Tone Chromatic Number of Random Graphs
A proper 2-tone k-coloring of a graph is a labeling of the vertices with elements from ( [k] 2 ) such that adjacent vertices receive disjoint labels and vertices distance 2 apart receive distinct labels. The 2-tone chromatic number of a graph G, denoted τ2(G) is the smallest k such that G admits a proper 2-tone k coloring. In this paper, we prove that w.h.p. for p ≥ Cn−1/4 ln n, τ2(Gn,p) = (2 +...
متن کاملParallel Distance-k Coloring Algorithms for Numerical Optimization
Matrix partitioning problems that arise in the efficient estimation of sparse Jacobians and Hessians can be modeled using variants of graph coloring problems. In a previous work [6], we argue that distance-2 and distance3 2 graph coloring are robust and flexible formulations of the respective matrix estimation problems. The problem size in large-scale optimization contexts makes the matrix esti...
متن کاملColoring Geographical Threshold Graphs
We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 38 شماره
صفحات -
تاریخ انتشار 2011